A Construction of A New Class of Knapsack-Type Public Key Cryptosystem, K(III)ΣPKC

نویسنده

  • Masao KASAHARA
چکیده

In this paper, we present a new class of knapsack type PKC referred to as K(III)ΣPKC. In a sharp contrast with the conventional knapsack type PKC’s, in our proposed scheme, K(I II)ΣPKC, no conventional secret sequence but the natural binary number with noise is used. We show that the coding rate, a more conservative measure for the security on knapsack PKC, can be made approximately 1.0. In Appendix, we present K(II)ΣPKC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Class of Product-sum Type Public Key Cryptosystem, K(V)ΣΠPKC, Constructed Based on Maximum Length Code

The author recently proposed a new class of knapsack type PKC referred to as K(II)ΣΠPKC [1]. In K(II)ΣΠPKC with old algorithm DA[I], Bob randomly constructs a very small subset of Alice’s set of public key whose order is very large, under the condition that the coding rate ρ satisfies 0.01 < ρ < 0.2. In K(II)ΣΠPKC, no secret sequence such as super-increasing sequence or shifted-odd sequence but...

متن کامل

Construction of New Classes of Knapsack Type Public Key Cryptosystem Using Uniform Secret Sequence, K(II)ΣΠPKC, Constructed Based on Maximum Length Code

Abstract In this paper, we present a new class of knapsack type PKC referred to as K(II)ΣΠPKC. In K(II)ΣΠPKC, Bob randomly constructs a very small subset of Alice’s set of public key whose order is very large, under the condition that the coding rate ρ satisfies 0.01 < ρ < 0.5. In K(II)ΣΠPKC, no secret sequence such as super-increasing sequence or shifted-odd sequence but the sequence whose com...

متن کامل

Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem

— Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasi...

متن کامل

A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields

A new knapsack-type public key cryptosystem is introduced. The system is based on a novel application of arithmetic in finite fields, following a construction by Bose and Chowla. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their sue in bits. In particular, the density can b...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011